package com.timous.tree;

import java.util.List;
import java.util.Queue;

/**
 * https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/
 * @author Timous
 * @create 2020-12-22 15:15
 **/
public class _103_二叉树的锯齿形层序遍历 {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
//        List queue = new Queue<Integer>();
        return null;
    }
}
